[livres divers classés par sujet] [Informatique] [Algorithmique] [Programmation] [Mathématiques] [Hardware] [Robotique] [Langage] [Intelligence artificielle] [Réseaux]
[Bases de données] [Télécommunications] [Chimie] [Médecine] [Astronomie] [Astrophysique] [Films scientifiques] [Histoire] [Géographie] [Littérature]

Fragments of first-order logic over infinite words

contributor FMI, Theoretische Informatik
creator Diekert, Volker
Kufleitner, Manfred
date 2009-06-16
description 24 pages
We give topological and algebraic characterizations as well as language theoretic descriptions of the following subclasses of first-order logic for omega-languages: Sigma2, FO2, the intersection of FO2 and Sigma2, and Delta2 (and by duality Pi2 and the intersection of FO2 and Pi2). These descriptions extend the respective results for finite words. In particular, we relate the above fragments to language classes of certain (unambiguous) polynomials. An immediate consequence is the decidability of the membership problem of these classes, but this was shown before by Wilke and Bojanczyk and is therefore not our main focus. The paper is about the interplay of algebraic, topological, and language theoretic properties.
format application/pdf
283809 Bytes
identifier  http://www.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=TR-2009-04&engl=1
language eng
publisher Stuttgart, Germany, Universität Stuttgart
relation Technical Report No. 2009/04
source ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/TR-2009-04/TR-2009-04.pdf
subject Mathematical Logic (CR F.4.1)
Formal Languages (CR F.4.3)
infinite words
regular languages
first-order logic
automata theory
semigroups
topology
title Fragments of first-order logic over infinite words
type Text
Technical Report